Combinational Circuit Design with Estimation of Distribution Algorithms
نویسندگان
چکیده
The authors introduce new approaches for the combinational circuit design based on Estimation of Distribution Algorithms. In this paradigm, the structure and data dependencies embedded in the data (population of candidate circuits) are modeled by a conditional probability distribution function. The new population is simulated from the probability model thus inheriting the dependencies. The authors explain the procedure to build an approximation of the probability distribution through two approaches: polytrees and Bayesian networks. A set of circuit design experiments is performed and a comparison with evolutionary approaches is reported.
منابع مشابه
Analysis Of The Complexity Of Exact Power Estimation Problems
Although many algorithms for power estimation have been proposed to date, no comprehensive results have been presented on the actual complexity of power estimation problems. In this paper we select a number of relevant problems and show that they belong to classes of high complexity. In particular we show that: a) for a given combinational circuit, the decision version of the peak power estimat...
متن کاملOn The Complexity Of Power Estimation Problems
Although many algorithms for power estimation have been proposed to date, no comprehensive results have been presented on the actual complexity of power estimation problems. In this paper we select a number of relevant problems and show that they belong to classes of high complexity. In particular we show that: a) for a given combinational circuit, the decision version of the peak power estimat...
متن کاملCombinational Logic Circuit Design with the Buchberger Algorithm
We detail a procedure for the computation of the polynomial form of an electronic combinational circuit from the design equations in a truth table. The method uses the Buchberger algorithm rather than current traditional methods based on search algorithms. We restrict the analysis to a single output, but the procedure can be generalized to multiple outputs. The procedure is illustrated with the...
متن کاملAlgorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is also in the core of algorithms for solving Binate Covering Problems. This paper starts by describing how B...
متن کاملSoft error rate estimation for Combinational Logic in Presence of Single Event Multiple Transients
Fast and accurate estimation of soft error rate in VLSI circuits is an essential step in a soft error tolerant ASIC design. In order to have a cost e®ective protection against radiation e®ects in combinational logics, an accurate and fast method for identi ̄cation of most susceptive gates and paths is needed. In this paper, an e±cient, fast and accurate method for soft error propagation probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010